An Efficient Algorithm for Decomposition of Partially Ordered Sets

Efficient time complexities for partial ordered sets or posets are well-researched field. Hopcroft and Karp introduced an algorithm that solves the minimal chain decomposition in O (n2.5) time. Felsner et al. proposed reduces complexity to (kn2) such n is number of elements poset k its width. The main goal this paper proposing efficient compute width a given partially set P according Dilworth’s theorem. It simple algorithm. (kn), P. computational results show outperforms other related algorithms.